A Preprocessing Algorithm Applicable to the Multiuser Detection Problem, Report no. LiTH-ISY-R-2716

نویسندگان

  • Daniel Axehill
  • Fredrik Gunnarsson
  • Anders Hansson
چکیده

In this paper a preprocessing algorithm for binary quadratic programming problems is presented. For some types of binary quadratic programming problems, the algorithm can compute the optimal value for some or all integer variables without approximations in polynomial time. When the optimal multiuser detection problem is formulated as a maximum likelihood problem, a binary quadratic programming problem has to be solved. Fortunately, the low correlation between different users in the multiuser detection problem enables the use of the preprocessing algorithm. Simulations show that the preprocessing algorithm is able to compute almost all variables in the problem, even though the system is heavily loaded and affected by noise.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Planning Algorithm of a Gimballed EO/IR Sensor for Multi Target Tracking, Report no. LiTH-ISY-R-2887

This report proposes an algorithm for planning the aiming direction of a vision sensor with limited field-of-view for tracking of multiple targets. The sensor is mounted in an actuated gimbal on an unmanned aerial vehicle (UAV). Dynamic constraints of the gimbal are included implicitly and a genetic algorithm is used to solve the optimization problem.

متن کامل

Robust point-mass filters on manifolds, Report no. LiTH-ISY-R-2935

Robust state estimation for states evolving on compact manifolds is achieved by employing a point-mass filter. The proposed implementation emphasizes a sane treatment of the geometry of the problem, and advocates separation of the filtering algorithms from the implementation of particular manifolds.

متن کامل

A Decomposition Algorithm for KYP-SDPs, Report no. LiTH-ISY-R-2919

In this paper, a structure exploiting algorithm for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma, where some of the constraints appear as complicating constraints is presented. A decomposition algorithm is proposed, where the structure of the problem can be utilized. In a numerical example, where a controller that minimizes the sum of the H2-norm and the H∞-norm is desig...

متن کامل

Autonomous Navigation using Active Perception Report LiTH-ISY-R-2395

This report starts with an introduction to the concepts active perception, reactive systems, and state dependency, and to fundamental aspects of perception such as the perceptual aliasing problem, and the number-of-percepts vs. number-of-states trade-off. We then introduce finite state machines, and extend them to accommodate active perception. Finally we demonstrate a state-transition mechanis...

متن کامل

Time-Varying Parameter Estimation under Stochastic Perturbations Using LSM, Report no. LiTH-ISY-R-3019

In this paper, we deal with the problem of continuous-time timevarying parameter estimation in stochastic systems, under 3 different kinds of stochastic perturbations: additive and multiplicative white noise, and colored noise. The proposed algorithm is based on the Least Squares Method with forgetting factor. Some numerical examples illustrate the effectiveness of the proposed algorithm. An an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005